On dynamic threshold graphs and related classes
نویسندگان
چکیده
منابع مشابه
Dynamically Operating on Threshold Graphs and Related Classes (Extended Abstract)
A graph G = (V,E) is a threshold graph if there is a mapping a : V → R+ and a positive real number S such that a(v) < S for all v ∈ V and (v, w) ∈ E if and only if a(v) + a(w) ≥ S. It is well known that G can be partitioned into a clique K and a stable set I. Threshold graphs constitute a very important and well studied class in graph theory and graph algorithms, since they have applications in...
متن کاملLaplacian Controllability Classes for Threshold Graphs
Let G be a graph on n vertices with Laplacian matrix L and let b be a binary vector of length n. The pair (L,b) is controllable if the smallest L-invariant subspace containing b is of dimension n. The graph G is called essentially controllable if (L,b) is controllable for every b / ∈ ker(L), completely uncontrollable if (L,b) is uncontrollable for every b, and conditionally controllable if it i...
متن کاملGraphs Classes Related to Bipartite Graphs
We continue the study of the following general problem on vertex colorings of graphs. Suppose that some vertices of a graph G are assigned to some colors. Can this “precoloring” be extended to a proper coloring of G with at most k colors (for some given k)? Here we investigate the complexity status of precoloring extendibility on some graph classes which are related to bipartite graphs, giving ...
متن کاملOn equistable, split, CIS, and related classes of graphs
We consider several graphs classes defined in terms of conditions on cliques and stable sets, including CIS, split, equistable, and other related classes. We pursue a systematic study of the relations between them. As part of this study, we introduce two generalizations of CIS graphs, obtain a new characterization of split graphs, and a characterization of CIS line graphs.
متن کاملRelating threshold tolerance graphs to other graph classes
A graph G = (V, E) is a threshold tolerance if it is possible to associate weights and tolerances with each node of G so that two nodes are adjacent exactly when the sum of their weights exceeds either one of their tolerances. Threshold tolerance graphs are a special case of the well-known class of tolerance graphs and generalize the class of threshold graphs which are also extensively studied ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2018
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2017.01.007